On the Semantics of Classical First-order Logic with Constructive Double Negation

نویسنده

  • Ken Kaneiwa
چکیده

Constructive negation in intuitionistic logic (called strong negation [7]) can be used to directly represent negative assertions, and for which its semantics [8, 1] is defined in Kripke models by two satisfaction relations (|= P and |= N ). However, the interpretation and satisfaction based on the conventional semantics do not fit in with the definition of negation in knowledge representation when considering a double negation of the form ∼¬, for strong negation ∼ and classical negation ¬ (which we call constructive double negation). The problem is caused by the fact that the semantics makes the axiom ∼¬A ↔ A valid. By way of solution, this paper proposes an alternative semantics for constructive double negation ∼¬A by capturing the constructive meaning of the combinations of the two negations. In the semantics, we consider the constructive double negation ∼¬A as partial to the classical double negation ¬¬A and as exclusive to the classical negation ¬A. Technically, we introduce infinite satisfaction relations to interpret the partiality that is sequentially created by each constructive double negation (of the forms ∼¬A,∼¬∼¬A, . . . ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Variant of Thomason ' s First - order Logic CFBased

In this paper, we de ne a rst-order logic CF 0 with strong negation and bounded classical quanti ers, which is a variant of Thomason's logic CF . For the logic CF 0, the usual Kripke formal semantics is dened based on situations, and a sound and complete axiomatic system is established based on the axiomatic systems of constructive logics with strong negation and Thomason's completeness proof t...

متن کامل

Negation in Logic Programming: A Formalization in Constructive Logic

The conventional formalization of logic programming in classical logic explains very convincingly the basic principles of this programming style. However, it gives no easy or intuitive explanations for the treatment of negation. Logic Programming handles negation through the so-called ^Negation as Failure" inference principle which is rather unconventional from the viewpoint of classical logic....

متن کامل

Negations in Description Logic – Contraries, Contradictories, and Subcontraries

In [10], several constructive description logics were proposed as intuitionistic variants of description logics, in which classical negation was replaced by strong negation as a component to treat negative atomic information. For conceptual representation, not only strong negation but also combining it with classical negation seems to be useful and necessary due to their respective features cor...

متن کامل

Virtual Evidence: A Constructive Semantics for Classical Logics

This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems prima facie impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it does not have computational meaning. However, the apparently oracular powers expressed in the LEM, that for any proposition P either it or its n...

متن کامل

On the Propositional SLDNF-Resolution

We consider propositional logic programs with negations. We deene notions of constructive transformation and constructive completion of a program. We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. We show that the three-valued and four-valued x-point or declarative seman...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005